A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks

Connected dominating set based routing is a promising approach for enhancing the routing efficiency in the mobile ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is an NP-complete problem. Restricted Rule k is a localized algorithm for finding a small dominating set in mobile ad hoc networks. It starts with a large initial dominating set and uses the local information of all neighbors of a node to attempt to remove the node from the set. In this paper, instead of using a large initial set, we use a rather small number of nodes as the initial set and then reduce the size of the set with Rule k algorithm. The small initial set is generated by a distributed NLogN algorithm with lower computational complexity than Rule k. The simulation results show that using the small set generated with NLogN algorithm as the initial set can make Rule k algorithm to achieve better performance.